Scheduling block-cyclic array redistribution
نویسندگان
چکیده
منابع مشابه
Scheduling Block-Cyclic Array Redistribution
This article is devoted to the run-time redistribution of arrays that are distributed in a blockcyclic fashion over a multidimensional processor grid. While previous studies have concentrated on e ciently generating the communication messages to be exchanged by the processors involved in the redistribution, we focus on the scheduling of those messages: how to organize the message exchanges into...
متن کاملMore on Scheduling Block-Cyclic Array Redistribution
This article is devoted to the run-time redistribution of one-dimensional arrays that are distributed in a block-cyclic fashion over a processor grid. In a previous paper 2], we have reported how to derive optimal schedules made up of successive communication-steps. In this paper we assume that successive steps may overlap. We show how to obtain an optimal scheduling for the most general case, ...
متن کاملBlock Cyclic Array Redistribution Ecole Normale Supérieure De Lyon Block Cyclic Array Redistribution
Implementing linear algebra kernels on distributed memory parallel computers raises the problem of data distribution of matrices and vectors among the processors Block cyclic distribution seems to suit well for most algorithms But one has to choose a good compromise for the size of the blocks to achieve a good e ciency and a good load balancing This choice heavily depends on each operation so i...
متن کاملEecient Algorithms for Block-cyclic Array Redistribution between Processor Sets
Run-time array redistribution is necessary to enhance the performance of parallel programs on distributed memory supercomputers. In this paper, we present an eecient algorithm for array redistribution from cyclic(x) on P processors to cyclic(Kx) on Q processors. The algorithm reduces the overall time for communication by considering the data transfer, communication schedule, and index computati...
متن کاملSparse Matrix Block-Cyclic Redistribution
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterization of the sparse matrix redistribution and its associate problematic due to the use of compressed representations. Two main improvements about the buffering and the coordinates calculation modify the original algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1998
ISSN: 1045-9219
DOI: 10.1109/71.663945